package cuiyt.datastructure.queue.criclequeue;


/**
 * @author cyt
 * @create 2020-12-05 21:03
 */
public class CriCleQueueTest {

    public static void main(String[] args) {
        CriCleQueue<Integer> queue = new CriCleQueue<>();
        queue.enQueue(1);
        queue.enQueue(2);
        queue.enQueue(3);
        queue.enQueue(4);
        // 4 3 2 1
        System.out.println(queue.deQueue());
        System.out.println(queue.deQueue());
        System.out.println(queue.front());
        System.out.println(queue.deQueue());
        System.out.println(queue.front());
        System.out.println(queue);
        queue.enQueue(2);
        queue.enQueue(3);
        queue.enQueue(4);

        queue.enQueue(2);
        queue.enQueue(3);
        queue.enQueue(4);

        queue.enQueue(44);
        queue.enQueue(55);
        queue.enQueue(66);
        queue.enQueue(44);
        queue.enQueue(55);
        queue.enQueue(66);
        queue.enQueue(44);
        queue.enQueue(55);
        queue.enQueue(66);
        queue.enQueue(44);
        queue.enQueue(55);
        queue.enQueue(66);
        System.out.println(queue);
    }

}
